public class SearchInsert {
    public int code(int[] nums, int target) {
        int left = 0, right = nums.length - 1;
        while (left < right){
            int mid = left + (right - left) / 2;
            if (nums[mid] >= target){
                right = mid;
            }else {
                left = mid + 1;
            }
        }

        if (nums[right] < target){
            return right + 1;
        }
        return right;
    }
}
